Near term algorithms for linear systems of equations

نویسندگان

چکیده

Abstract Finding solutions to systems of linear equations is a common problem in many areas science and engineering, with much potential for speed up on quantum devices. While the Harrow–Hassidim–Lloyd (HHL) algorithm yields an exponential over classical algorithms some cases, it requires fault-tolerant computer, which unlikely be available near-term. Thus, attention has turned investigation noisy intermediate-scale (NISQ) devices where several near-term approaches solving have been proposed. This paper focuses Variational Quantum Linear Solvers (VQLS), other closely related methods adaptions. Several contributions are made this paper, include: first application Evolutionary Ansatz VQLS (EAVQLS), implementation Logical (LAVQLS), based Classical Combination States (CQS) method, proof principle demonstration CQS method real hardware Adiabatic (AAVQLS). These implemented contrasted. The run moderate success device. EAVQLS AAVQLS show promise as possible improvements standard once refined.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Algorithms for Systems of Linear Equations

This article reviews the 2008 quantum algorithm for linear systems of equations due to Harrow, Hassidim and Lloyd, as well as some of the followup and related work. It was submitted to the Springer Encyclopedia of Algorithms. 1 Problem Definition The problem is to find a vector x ∈ C such that Ax = b, for some given inputs A ∈ CN×N and b ∈ C . Several variants are also possible, such as rectang...

متن کامل

Scalable Parallel Algorithms for Solving Sparse Systems of Linear Equations∗

We have developed a highly parallel sparse Cholesky factorization algorithm that substantially improves the state of the art in parallel direct solution of sparse linear systems—both in terms of scalability and overall performance. It is a well known fact that dense matrix factorization scales well and can be implemented efficiently on parallel computers. However, it had been a challenge to dev...

متن کامل

Stable and Efficient Algorithms for Structured Systems of Linear Equations

Recent research shows that structured matrices such as Toeplitz and Hankel matrices can be transformed into a diierent class of structured matrices called Cauchy-like matrices using the FFT or other trigonometric transforms. Gohberg, Kailath and Olshevsky demonstrate numerically that their fast variation of the straightforward Gaussian elimination with partial pivoting (GEPP) procedure on Cauch...

متن کامل

Parallel Overrelaxation Algorithms for Systems of Linear Equations

Parallel versions of the Jacobi and Successive Overrelaxation methods to solve systems of linear equations on a network of transputers are discussed. The Jacobi method is easily parallelizable, by distributing the data in a rowwise fashion among the processors. The SOR is a less obviously parallelizable method due to data-dependency issues, although some computation can still be distributed. An...

متن کامل

NEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS

We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2023

ISSN: ['1573-1332', '1570-0755']

DOI: https://doi.org/10.1007/s11128-023-04020-2